Decidability of model checking with the temporal logic EF
نویسندگان
چکیده
منابع مشابه
Decidability of model checking with the temporal logic EF
The branching-time temporal logic EF is a simple, but natural fragment of computation tree logic (CTL) and the modal-calculus. We study the decidability of the model checking problem for EF and innnite-state systems. We use process rewrite systems (PRS) to describe innnite-state systems and deene a hierarchy of subclasses of PRS that includes Petri nets, pushdown processes, Basic Parallel Proce...
متن کاملTemporal Logic Model Checking
ion reduces the state space by removing irrelevant features of a Kripke structure. Given a Kripke structure K, an abstraction is a Kripke structure K̂ such that K̂ is significantly smaller than K, and K̂ preserves a useful class of specifications for K. Consequently, the expensive task of model checking K can be reduced to the more feasible task of model checking K̂. We know from above that in orde...
متن کاملThe Complexity of Temporal Logic Model Checking
Temporal logic. Logical formalisms for reasoning about time and the timing of events appear in several fields: physics, philosophy, linguistics, etc. Not surprisingly, they also appear in computer science, a field where logic is ubiquitous. Here temporal logics are used in automated reasoning, in planning, in semantics of programming languages, in artificial intelligence, etc. There is one area...
متن کاملExploiting Symmetry In Temporal Logic Model Checking
In practice, finite state concurrent systems often exhibit considerable symmetry. We investigate techniques for reducing the complexity of temporal logic model checking in the presence of symmetry. In particular, we show that symmetry can frequently be used to reduce the size of the state space that must be explored during model checking. In the past, symmetry has been exploited in computing th...
متن کاملLinear Temporal Logic: Expressiveness and Model Checking
Model checking of finite-state systems with specifications given as formulae of Linear Temporal Logic (LTL) is one of the most common verification problems. Like other verification problems, LTL model checking suffers from state explosion. Techniques tackling state explosion usually employ some specific property of the LTL fragment they are designed for. For example, a popular method called par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00101-8